-
1 AI-complete problem
Программирование: AI-полная задача, решаемая средствами искусственного интеллекта задача (= artificial intelligence complete problem) -
2 AI-complete problem
English-Russian electronics dictionary > AI-complete problem
-
3 AI-complete problem
The New English-Russian Dictionary of Radio-electronics > AI-complete problem
-
4 NP-complete problem
Англо-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > NP-complete problem
-
5 NP-complete problem
полная задача, переборная задача, полиномиально разрешимая на недетерминированных машинахАнгло-русский словарь по компьютерной безопасности > NP-complete problem
-
6 90% complete problem
проблема 90%-ной готовности (касающаяся несвоевременного перераспределения ресурсов программирования в крупных проектах)English-Russian dictionary of computer science and programming > 90% complete problem
-
7 ninety percent complete problem
проблема 90%-ной готовности (касающаяся несвоевременного перераспределения ресурсов программирования в крупных проектах)Большой англо-русский и русско-английский словарь > ninety percent complete problem
-
8 artificial intelligence complete problem
Универсальный англо-русский словарь > artificial intelligence complete problem
-
9 ninety percent complete problem
Вычислительная техника: проблема 90%-й готовности (о несвоевременном перераспределении ресурсов программирования в крупных проектах)Универсальный англо-русский словарь > ninety percent complete problem
-
10 nondeterministic polynomial time complete problem
Программирование: NP-полная задача, полиномиальная для недетерминированной машины Тьюринга задача ( поиска и принятия решения), решаемая за полиномиальное время на недетерминированной машине Тьюринга задача (поиска и принятия решения)Универсальный англо-русский словарь > nondeterministic polynomial time complete problem
-
11 artificial intelligence complete problem
AI-полная задача, решаемая средствами искусственного интеллекта задача (поиска и-принятия решения)English-Russian electronics dictionary > artificial intelligence complete problem
-
12 nondeterministic polynomial time complete problem
NP-полная задача, полиномиальная для недетерминированной машины Тьюринга задача (поиска и-принятия решения), решаемая за полиномиальное время на недетерминированной машине Тьюринга задача (поиска и-принятия решения)English-Russian electronics dictionary > nondeterministic polynomial time complete problem
-
13 artificial intelligence complete problem
AI-полная задача, решаемая средствами искусственного интеллекта задача (поиска и принятия решения)The New English-Russian Dictionary of Radio-electronics > artificial intelligence complete problem
-
14 nondeterministic polynomial time complete problem
NP-полная задача, полиномиальная для недетерминированной машины Тьюринга задача (поиска и принятия решения), решаемая за полиномиальное время на недетерминированной машине Тьюринга задача (поиска и принятия решения)The New English-Russian Dictionary of Radio-electronics > nondeterministic polynomial time complete problem
-
15 ninety percent complete problem
проблема 90%-ной готовности (касающаяся несвоевременного перераспределения ресурсов программирования в крупных проектах)English-Russian dictionary of computer science and programming > ninety percent complete problem
-
16 problem
1) проблема; задача2) проблемный3) вчт прикладной ( о программе или программисте)•- AI-complete problem
- artificial intelligence complete problem
- assignment problem
- backup problem
- benchmark problem
- bottleneck problem
- Cauchy problem
- check problem
- collision domain problem
- complementary nondeterministic polynomial time problem
- computational problem
- CoNP problem
- credit assignment problem
- decision problem
- design problem
- dimensionality problem
- domino problem
- dual problem
- eigenvalue problem
- eigenvalue assignment problem
- eight queens problem
- EVA problem
- exclusive OR problem
- feasible problem
- formalized problem
- halting problem
- identification problem
- ill-conditioned problem
- incorrectly structured problem
- key distribution problem
- Königsberg bridge problem
- last mile problem
- maximal clique problem
- multiple comparisons problem
- multi-sample problem
- nondeterministic polynomial time problem
- nondeterministic polynomial time complete problem
- nondeterministic polynomial time hard problem
- NP problem
- NPC problem
- NPH problem
- NUXI problem
- one-sample problem
- P-problem
- polynomial time problem
- Post problem
- Post correspondence problem
- Riemann-Hilbert problem
- roller-coaster problem
- satisfiability problem
- scale-up problem
- semi-structured problem
- SIEB problem
- slow-path problem
- sparse problem
- steadily injected electron beam problem
- Steiner problem on graphs
- structured problem
- test problem
- transcomputational problem
- traveling salesman problem
- trouble-location problem
- unformalized problem
- unstructured problem
- variational problem
- Y2K problem
- year 2000 problem -
17 problem
1) проблема; задача2) проблемный3) вчт. прикладной ( о программе или программисте)•- artificial intelligence complete problem
- assignment problem
- backup problem
- benchmark problem
- bottleneck problem
- Cauchy problem
- check problem
- collision domain problem
- complementary nondeterministic polynomial time problem
- computational problem
- CoNP problem
- credit assignment problem
- decision problem
- design problem
- dimensionality problem
- domino problem
- dual problem
- eigenvalue assignment problem
- eigenvalue problem
- eight queens problem
- EVA problem
- exclusive OR problem
- feasible problem
- formalized problem
- halting problem
- identification problem
- ill-conditioned problem
- incorrectly structured problem
- key distribution problem
- Königsberg bridge problem
- last mile problem
- maximal clique problem
- multiple comparisons problem
- multi-sample problem
- nondeterministic polynomial time complete problem
- nondeterministic polynomial time hard problem
- nondeterministic polynomial time problem
- NP problem
- NPC problem
- NPH problem
- NUXI problem
- one-sample problem
- P problem
- polynomial time problem
- Post correspondence problem
- Post problem
- problem of allocation
- Riemann-Hilbert problem
- roller-coaster problem
- satisfiability problem
- scale-up problem
- semi-structured problem
- SIEB problem
- slow-path problem
- sparse problem
- steadily injected electron beam problem
- Steiner problem on graphs
- structured problem
- test problem
- transcomputational problem
- traveling salesman problem
- trouble-location problem
- unformalized problem
- unstructured problem
- variational problem
- Y2K problem
- year 2000 problemThe New English-Russian Dictionary of Radio-electronics > problem
-
18 problem
задача; проблема- accounting problem
- allocation problem
- assignment problem
- ballot problem
- benchmark problem
- blending problem
- bottleneck problem
- boundary-value problem
- boundary problem
- business problem
- Byzantine Generals problem
- center problem
- check problem
- chess problem
- commonly encountered problem
- computational problem
- continuum problem
- covering problem
- data problem
- data-set problem
- daunting problem
- decision problem
- deducibility problem
- design problem
- dining philosophers' problem
- dual problem
- eigenvalue assignment problem
- eigenvalue problem
- estimation problem
- EVA problem
- extremely ill-conditioned problem
- fault-location problem
- filtering problem
- findpath problem
- finger-pointing problem
- flow problem
- frame problem
- free-boundary problem
- game-theory problem
- game problem
- graph theoretic problem
- graphics problem
- ill-conditioned problem
- ill-defined problem
- ill-posed problem
- inference problem
- information retrieval problem
- initial value problem
- intractable problem
- job-shop problem
- knapsack problem
- Konigsberg bridge problem
- labyrinth problem
- location problem
- logical problem
- management problem
- market analysis problem
- marriage problem
- maximum flow problem
- maximum network flow problem
- mildly ill-posed problem
- minimal connector problem
- model problem
- multivariate problem
- newspaper-boy problem
- ninety percent complete problem
- nominal design problem
- off-by-one problem
- omelet problem
- one-sample problem
- postman problem
- programming problem
- projection problem
- pursuit problem
- quadratic assignment problem
- queuing problem
- race problem
- ramification problem
- real-time problem
- real-world problem
- reducibility problem
- resource allocation problem
- routing problem
- ruin problem
- satisfiability problem
- scheduling problem
- search problem
- severely ill-posed problem
- shortest route problem
- simulated problem
- software problem
- sparse problem
- stale data problem
- stochastic problem
- switchbox routing problem
- switchbox problem
- target assignment problem
- test problem
- three-dimensional problem
- time transportation problem
- trade-off problem
- traffic problem
- transport problem
- transportation problem
- traveling salesman problem
- trouble-location problem
- troubleshooting problem
- unconstrained problem
- undecidable problem
- underdetermined problem
- unsolvable problem
- unstructured problem
- variational problem
- vessel loading problem
- waiting line problem
- weak bridge problem
- well-behaved problem
- well-defined problem
- well-posed problemEnglish-Russian dictionary of computer science and programming > problem
-
19 problem
задача; проблемаАнгло-русский словарь по компьютерной безопасности > problem
-
20 problem-definition prerequisite
Программирование: предварительные условия, связанные с постановкой задачи (см. Code Complete / Steve McConnell.-2nd ed. (2004))Универсальный англо-русский словарь > problem-definition prerequisite
См. также в других словарях:
NP-complete problem — ▪ computer science any of a class of computational problems for which no efficient solution algorithm has been found. Many significant computer science problems belong to this class e.g., the traveling salesman problem, satisfiability… … Universalium
Problem solving — forms part of thinking. Considered the most complex of all intellectual functions, problem solving has been defined as higher order cognitive process that requires the modulation and control of more routine or fundamental skills (Goldstein Levin … Wikipedia
Complete bipartite graph — A complete bipartite graph with m = 5 and n = 3 Vertices n + m Edges mn … Wikipedia
Complete (complexity) — In computational complexity theory, a computational problem is complete for a complexity class if it is, in a formal sense, one of the hardest or most expressive problems in the complexity class. If a problem has the property that it allows you… … Wikipedia
Complete coloring — of the Clebsch graph with 8 colors. Every pair of colors appears on at least one edge. No complete coloring with more colors exists: in any 9 coloring some color would appear only at one vertex, and there would not be enough neighboring vertices… … Wikipedia
Complete information — is a term used in economics and game theory to describe an economic situation or game in which knowledge about other market participants or players is available to all participants. Every player knows the payoffs and strategies available to other … Wikipedia
Problem Frames Approach — Problem Analysis or the Problem Frames Approach is an approach to software requirements analysis. It was developed by British software consultant Michael A. Jackson. The Problem Frames Approach was first sketched by Jackson in his book Software… … Wikipedia
Complete Works of Shakespeare — Complete Works of William Shakespeare is the standard name given to any volume containing all the plays and poems of William Shakespeare. Some editions include several works which were not completely of Shakespeare s authorship (collaborative… … Wikipedia
Complete Savages — intertitle Genre Sitcom Created by … Wikipedia
Complete lattice — In mathematics, a complete lattice is a partially ordered set in which all subsets have both a supremum (join) and an infimum (meet). Complete lattices appear in many applications in mathematics and computer science. Being a special instance of… … Wikipedia
Complete mixing — In evolutionary game theory, complete mixing refers to an assumption about the type of interactions that occur between individual organisms. Interactions between individuals in a population attains complete mixing if and only if the probably… … Wikipedia